Process algebra with guards: Combining Hoare logic with process algebra

Process Algebra with Backtracking

An extension of process algebra for modelling processes with backtracking is introduced. This extension is semantically based on processes that transform data because, in our view, backtracking is the undoing of the eeects caused by a process in some initial data-state if this process fails. The data-states are given by a data environment, which is a structure that also deenes in which data-sta...

Process Algebra with Iteration

We introduce iteration in process algebra by means of (the binary version of) Kleene's star operator: x y is the process that chooses between x and y, and upon termination of x has this choice again. It is proved that adding respectively interleaving, communication and abstraction operators increases expressivity up to the regular processes. However, if the distinction between (successful) term...

Process Algebra with Recursive

Process Algebra with Combinators

We introduce typed combinatory process algebra, a system combining process algebra with types and combinators. We describe its syntax and semantics, and by way of example, verify within this framework the Simple Alternating Bit Protocol.

Process Algebra and Hoare's Logic

A Hoare-like logic is introduced for deriving`partial correctness assertions' of the form fg p fg, where ; are unary predicates over some state space S and p is an expression over a recursive, non-uniform language containing global nondeterminism (+) and sequential composition (). This logic is (relatively) complete if only guarded recursion is considered.